Dynamical Decoupling in Optical Fibers: Preserving Polarization Qubits from Birefringent Dephasing

One of the major challenges in quantum computation has been to preserve the coherence of a quantum system against dephasing effects of the environment. The information stored in photon polarization, for example, is quickly lost due to such dephasing, and it is crucial to preserve the input states when one tries to transmit quantum information encoded in the photons through a communication channel. We propose a dynamical decoupling sequence to protect photonic qubits from dephasing by integrating wave plates into optical fiber at prescribed locations. We simulate random birefringent noise along realistic lengths of optical fiber and study preservation of polarization qubits through such fibers enhanced with Carr-Purcell-Meiboom-Gill (CPMG) dynamical decoupling. This technique can maintain photonic qubit coherence at high fidelity, making a step towards achieving scalable and useful quantum communication with photonic qubits.Comment: 8 pages, 5 figure

Dynamical decoupling of a qubit with always-on control fields

We consider dynamical decoupling schemes in which the qubit is continuously manipulated by a control field at all times. Building on the theory of the Uhrig Dynamical Decoupling sequence (UDD) and its connections to Chebyshev polynomials, we derive a method of always-on control by expressing the UDD control field as a Fourier series. We then truncate this series and numerically optimize the series coefficients for decoupling, constructing the CAFE (Chebyshev and Fourier Expansion) sequence. This approach generates a bounded, continuous control field. We simulate the decoupling effectiveness of our sequence vs. a continuous version of UDD for a qubit coupled to fully-quantum and semi-classical dephasing baths and find comparable performance. We derive filter functions for continuous-control decoupling sequences, and we assess how robust such sequences are to noise on control fields. The methods we employ provide a variety of tools to analyze continuous-control dynamical decoupling sequences.Comment: 22 pages, 10 figure

Simulating chemistry efficiently on fault-tolerant quantum computers

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error $\epsilon$, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is $O(\log \epsilon)$ or $O(\log \log \epsilon)$; with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.Comment: 33 pages, 18 figure

Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation

In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing for a arbitrarily deep 3D cluster to be prepared using a comparatively small number of photonic qubits and consequently the elimination of high frequency, deterministic photon sources.Comment: 19 pages, 13 Figs (2 Appendices with additional Figs.). Comments welcom

Surface code quantum computing by lattice surgery

In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance 3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.Comment: Published version. 29 pages, 18 figure

A Systematic Study of Mid-Infrared Emission from Core-Collapse Supernovae with Spirits

The American Astronomical Society. All rights reserved.We present a systematic study of mid-infrared emission from 141 nearby supernovae (SNe) observed with Spitzer/IRAC as part of the ongoing SPIRITS survey. We detect 8 Type Ia and 36 core-collapse SNe. All Type Ia/Ibc SNe become undetectable within three years of explosion, whereas 22 ± 11% of Type II SNe continue to be detected. Five Type II SNe are detected even two decades after discovery (SN 1974E, 1979C, 1980K, 1986J, and 1993J). Warm dust luminosity, temperature, and a lower limit on mass are obtained by fitting the two IRAC bands, assuming an optically thin dust shell. We derive warm dust masses between 10-6 and 10-2 M o and dust color temperatures between 200 and 1280 K. This observed warm dust could be pre-existing or newly created, but in either case represents a lower limit to the dust mass because cooler dust may be present. We present three case studies of extreme SNe. SN 2011ja (II-P) was over-luminous ([4.5] = -15.6 mag) at 900 days post explosion with increasing hot dust mass, suggesting either an episode of dust formation or intensifying circumstellar material (CSM) interactions heating up pre-existing dust. SN 2014bi (II-P) showed a factor of 10 decrease in dust mass over one month, suggesting either dust destruction or reduced dust heating. The IR luminosity of SN 2014C (Ib) stayed constant over 800 days, possibly due to strong CSM interaction with an H-rich shell, which is rare among stripped-envelope SNe. The observations suggest that this CSM shell originated from an LBV-like eruption roughly 100 years pre-explosion. The observed diversity demonstrates the power of mid-IR observations of a large sample of SNe. © 2017

Replication and Virus-Induced Transcriptome of HAdV-5 in Normal Host Cells versus Cancer Cells - Differences of Relevance for Adenoviral Oncolysis

Adenoviruses (Ads), especially HAdV-5, have been genetically equipped with tumor-restricted replication potential to enable applications in oncolytic cancer therapy. Such oncolytic adenoviruses have been well tolerated in cancer patients, but their anti-tumor efficacy needs to be enhanced. In this regard, it should be considered that cancer cells, dependent on their tissue of origin, can differ substantially from the normal host cells to which Ads are adapted by complex virus-host interactions. Consequently, viral replication efficiency, a key determinant of oncolytic activity, might be suboptimal in cancer cells. Therefore, we have analyzed both the replication kinetics of HAdV-5 and the virus-induced transcriptome in human bronchial epithelial cells (HBEC) in comparison to cancer cells. This is the first report on genome-wide expression profiling of Ads in their native host cells. We found that E1A expression and onset of viral genome replication are most rapid in HBEC and considerably delayed in melanoma cells. In squamous cell lung carcinoma cells, we observed intermediate HAdV-5 replication kinetics. Infectious particle production, viral spread and lytic activity of HAdV-5 were attenuated in melanoma cells versus HBEC. Expression profiling at the onset of viral genome replication revealed that HAdV-5 induced the strongest changes in the cellular transcriptome in HBEC, followed by lung cancer and melanoma cells. We identified prominent regulation of genes involved in cell cycle and DNA metabolism, replication and packaging in HBEC, which is in accord with the necessity to induce S phase for viral replication. Strikingly, in melanoma cells HAdV-5 triggered opposing regulation of said genes and, in contrast to lung cancer cells, no weak S phase induction was detected when using the E2F promoter as reporter. Our results provide a rationale for improving oncolytic adenoviruses either by adaptation of viral infection to target tumor cells or by modulating tumor cell functions to better support viral replication